Naor–Yung paradigm with shared randomness and applications
نویسندگان
چکیده
منابع مشابه
Naor-Yung Paradigm with Shared Randomness and Applications
The Naor-Yung paradigm (Naor and Yung, STOC ’90) allows to generically boost security under chosen-plaintext attacks (CPA) to security against chosen-ciphertext attacks (CCA) for public-key encryption (PKE) schemes. The main idea is to encrypt the plaintext twice (under independent public keys), and to append a non-interactive zero-knowledge (NIZK) proof that the two ciphertexts indeed encrypt ...
متن کاملQuantum Random Access Codes with Shared Randomness
We consider a communication method, where the sender encodes n classical bits into 1 qubit and sends it to the receiver who performs a certain measurement depending on which of the initial bits must be recovered. This procedure is called n p 7→ 1 quantum random access code (QRAC) where p > 1/2 is its success probability. It is known that 2 0.85 7−→ 1 and 3 0.79 7−→ 1 QRACs (with no classical co...
متن کاملA Note on Shared Randomness and Shared Entanglement in Communication
We consider several models of 1-round classical and quantum communication, some of these models have not been defined before. We “almost separate” the models of simultaneous quantum message passing with shared entanglement and the model of simultaneous quantum message passing with shared randomness. We define a relation which can be efficiently exactly solved in the first model but cannot be so...
متن کاملRandomness extractors -- applications and constructions
Randomness extractors are efficient algorithms which convert weak random sources into nearly perfect ones. While such purification of randomness was the original motivation for constructing extractors, these constructions turn out to have strong pseudorandom properties which found applications in diverse areas of computer science and combinatorics. We will highlight some of the applications, as...
متن کاملMeasurement compression with quantum side information using shared randomness
We consider the problem of measurement compression with side information in the one-shot setting with shared randomness. In this problem, Alice shares a pure state with Referee and Bob and she performs a measurement on her registers. She wishes to communicate the outcome of this measurement to Bob using shared randomness only, in such a way that the outcome that Bob receives is correctly correl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2017
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2017.06.019